Complexity of monodic guarded fragments over linear and real time
نویسنده
چکیده
Propositional temporal logic is now well established, both in its theory and its utility for practical applications in computing. In contrast, predicate, or first-order, temporal logic has been less studied. Unpublished results of Lindström and Scott in the 1960s showed that even weak fragments of first-order temporal logic are highly undecidable, and these and later similar results (see, e.g., [6,15]) may have suggested that other areas were more profitable to work on.
منابع مشابه
Monodic Fragments of Probabilistic First-Order Logic
By classical results of Abadi and Halpern, validity for probabilistic first-order logic of type 2 (ProbFO) is Π 1 -complete and thus not recursively enumerable, and even small fragments of ProbFO are undecidable. In temporal first-order logic, which has similar computational properties, these problems have been addressed by imposing monodicity, that is, by allowing temporal operators to be appl...
متن کاملOn the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics
We study the complexity of some fragments of firstorder temporal logic over natural numbers time. The onevariable fragment of linear first-order temporal logic even with sole temporal operator2 is EXPSPACE-complete (this solves an open problem of [10]). So are the one-variable, two-variable and monadic monodic fragments with Until and Since. If we add the operators n, with n given in binary, th...
متن کاملHandling Equality in Monodic Temporal Resolution
First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments including the guarded fragment with equality. In this paper, we specialise the monodic reso...
متن کاملReasoning in many dimensions: uncertainty and products of modal logics
Description Logics (DLs) are a popular family of knowledge representation languages. They are fragments of first-order logic (FO) that combine high expressiveness with reasonable computational properties; in particular, most DLs are decidable. However, being based on first-order logic, they share also the shortcomings. One of these shortcomings is that DLs do not have built-in means to capture ...
متن کاملDecidable fragments of rst-order temporal logics
In this paper, we introduce a new fragment of the rst-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satissability problem for monodic formulas in various linear time structures can be reduced to the satissability problem for a certain fragment of classical rst-order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 138 شماره
صفحات -
تاریخ انتشار 2006